Classifying regular languages by a split game
نویسندگان
چکیده
منابع مشابه
Classifying regular languages by a split game
In this paper, we introduce a variant of the Ehrenfeucht-Fräıssé game from logic which is useful for analyzing the expressive power of classes of generalized regular expressions. An extension of the game to generalized ω-regular expressions is also established. To gain insight into how the game can be applied to attack the long-standing generalized star height 2 problem, we propose and solve a ...
متن کاملClassifying Regular Languages via Cascade Products of Automata
A significant result in the structure theory of regular languages is the Krohn-Rhodes Theorem, which states that any finite automaton can be decomposed into simple “prime factors”. This theorem can be stated in different versions using different products on different structures, namely the cascade product of automata, the wreath product of transformation semigroups and the block product of semi...
متن کاملTOPOLOGICAL CHARACTERIZATION FOR FUZZY REGULAR LANGUAGES
We present a topological characterization for fuzzy regular languages: we show that there is a bijective correspondence between fuzzy regular languages and the set of all clopen fuzzy subsets with finite image in the induced fuzzy topological space of Stone space (Profinite space), and then we give a representation of closed fuzzy subsets in the induced fuzzy topological space via fuzzy regular...
متن کاملClassifying ω-Regular Partitions
We try to develop a theory of ω-regular partitions in parallel with the theory around the Wagner hierarchy of regular ω-languages. In particular, we generalize a theorem of L. Staiger and K. Wagner to the case of partitions, prove decidability of all levels of the Boolean hierarchy of regular partitions over open sets, establish coincidence of reducibilities by continuous functions and by funct...
متن کاملClassifying Predicates and Languages
The present paper studies a particular collection of classi cation problems, i.e., the classi cation of recursive predicates and languages, for arriving at a deeper understanding of what classi cation really is. In particular, the classi cation of predicates and languages is compared with the classi cation of arbitrary recursive functions and with their learnability. The investigation undertake...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.12.041